Optimal Backlog in the Plane
نویسندگان
چکیده
Version • n cups – not on a graph nor in the plane • Timesteps – adversary pours total 1 of water – player empties any cup • Deamortization [Dietz,Sleator’87] – Empty-the-fullest: Hn An Extension: (τ,k)-game • n cups – not on a graph nor in the plane • Timesteps – adversary pours total τ of water – player empties k fullest cups • After r steps – backlog in any cup is ≤ Hr • τ / k • independent of n
منابع مشابه
A Mathematical Model for Flood Protection
Many regions in the world are protected against flooding by a dike, which may be either natural or artificial. We deal with a model for finding the optimal heights of such a dike in the future. It minimizes the sum of the investments costs for upgrading the dike in the future and the expected costs due to flooding. The model is highly nonlinear, nonconvex, and infinite-dimensional. Despite this...
متن کاملOptimization of two-stage production/inventory systems under order base stock policy with advance demand information
It is important to share demand information among the members in supply chains. In recent years, production and inventory systems with advance demand information (ADI) have been discussed, where advance demand information means the information of demand which the decision maker obtains before the corresponding actual demand arrives. Appropriate production and inventory control using demand info...
متن کاملProduction Control with Backlog-Dependent Demand
We study a manufacturing firm that builds a product to stock to meet a random demand. Production time is deterministic, so that if there is a backlog, customers are quoted a firm lead time that is proportional to the backlog. In order to represent the customers’ response to waiting, we introduce a new defection function — the probability that a customer chooses not to order as a function of the...
متن کاملOn the Design of Scheduling Algorithm for End-to-End Backlog Minimization in Wireless Multi-hop Networks
In this paper, we study the problem of link scheduling for multi-hop wireless networks with per-flow delay constraints. Specifically, we are interested in algorithms that maximize the asymptotic decay-rate of the probability with which the maximum end-to-end backlog among all flows exceeds a threshold, as the threshold becomes large. We provide both positive and negative results in this directi...
متن کاملOn the Six Node Hexagon Elements for Continuum Topology Optimization of Plates Carrying in Plane Loading and Shell Structures Carrying out of Plane Loading
The need of polygonal elements to represent the domain is gaining interest among structural engineers. The objective is to perform static analysis and topology optimization of a given continuum domain using the rational fraction type shape functions of six node hexagonal elements. In this paper, the main focus is to perform the topology optimization of two-dimensional plate structures using Evo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 605 شماره
صفحات -
تاریخ انتشار 2008